<HTML>
<BODY BGCOLOR="white">
<PRE>
<FONT color="green">001</FONT>    /*<a name="line.1"></a>
<FONT color="green">002</FONT>     * Licensed to the Apache Software Foundation (ASF) under one or more<a name="line.2"></a>
<FONT color="green">003</FONT>     * contributor license agreements.  See the NOTICE file distributed with<a name="line.3"></a>
<FONT color="green">004</FONT>     * this work for additional information regarding copyright ownership.<a name="line.4"></a>
<FONT color="green">005</FONT>     * The ASF licenses this file to You under the Apache License, Version 2.0<a name="line.5"></a>
<FONT color="green">006</FONT>     * (the "License"); you may not use this file except in compliance with<a name="line.6"></a>
<FONT color="green">007</FONT>     * the License.  You may obtain a copy of the License at<a name="line.7"></a>
<FONT color="green">008</FONT>     *<a name="line.8"></a>
<FONT color="green">009</FONT>     *      http://www.apache.org/licenses/LICENSE-2.0<a name="line.9"></a>
<FONT color="green">010</FONT>     *<a name="line.10"></a>
<FONT color="green">011</FONT>     * Unless required by applicable law or agreed to in writing, software<a name="line.11"></a>
<FONT color="green">012</FONT>     * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.12"></a>
<FONT color="green">013</FONT>     * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.13"></a>
<FONT color="green">014</FONT>     * See the License for the specific language governing permissions and<a name="line.14"></a>
<FONT color="green">015</FONT>     * limitations under the License.<a name="line.15"></a>
<FONT color="green">016</FONT>     */<a name="line.16"></a>
<FONT color="green">017</FONT>    <a name="line.17"></a>
<FONT color="green">018</FONT>    package org.apache.commons.math.optimization;<a name="line.18"></a>
<FONT color="green">019</FONT>    <a name="line.19"></a>
<FONT color="green">020</FONT>    import org.apache.commons.math.ConvergenceException;<a name="line.20"></a>
<FONT color="green">021</FONT>    import org.apache.commons.math.FunctionEvaluationException;<a name="line.21"></a>
<FONT color="green">022</FONT>    import org.apache.commons.math.MathRuntimeException;<a name="line.22"></a>
<FONT color="green">023</FONT>    import org.apache.commons.math.analysis.UnivariateRealFunction;<a name="line.23"></a>
<FONT color="green">024</FONT>    import org.apache.commons.math.random.RandomGenerator;<a name="line.24"></a>
<FONT color="green">025</FONT>    <a name="line.25"></a>
<FONT color="green">026</FONT>    /** <a name="line.26"></a>
<FONT color="green">027</FONT>     * Special implementation of the {@link UnivariateRealOptimizer} interface adding<a name="line.27"></a>
<FONT color="green">028</FONT>     * multi-start features to an existing optimizer.<a name="line.28"></a>
<FONT color="green">029</FONT>     * &lt;p&gt;<a name="line.29"></a>
<FONT color="green">030</FONT>     * This class wraps a classical optimizer to use it several times in<a name="line.30"></a>
<FONT color="green">031</FONT>     * turn with different starting points in order to avoid being trapped<a name="line.31"></a>
<FONT color="green">032</FONT>     * into a local extremum when looking for a global one.<a name="line.32"></a>
<FONT color="green">033</FONT>     * &lt;/p&gt;<a name="line.33"></a>
<FONT color="green">034</FONT>     * @version $Revision: 797786 $ $Date: 2009-07-25 12:13:55 -0400 (Sat, 25 Jul 2009) $<a name="line.34"></a>
<FONT color="green">035</FONT>     * @since 2.0<a name="line.35"></a>
<FONT color="green">036</FONT>     */<a name="line.36"></a>
<FONT color="green">037</FONT>    public class MultiStartUnivariateRealOptimizer implements UnivariateRealOptimizer {<a name="line.37"></a>
<FONT color="green">038</FONT>    <a name="line.38"></a>
<FONT color="green">039</FONT>        /** Serializable version identifier. */<a name="line.39"></a>
<FONT color="green">040</FONT>        private static final long serialVersionUID = 5983375963110961019L;<a name="line.40"></a>
<FONT color="green">041</FONT>    <a name="line.41"></a>
<FONT color="green">042</FONT>        /** Underlying classical optimizer. */<a name="line.42"></a>
<FONT color="green">043</FONT>        private final UnivariateRealOptimizer optimizer;<a name="line.43"></a>
<FONT color="green">044</FONT>    <a name="line.44"></a>
<FONT color="green">045</FONT>        /** Maximal number of iterations allowed. */<a name="line.45"></a>
<FONT color="green">046</FONT>        private int maxIterations;<a name="line.46"></a>
<FONT color="green">047</FONT>    <a name="line.47"></a>
<FONT color="green">048</FONT>        /** Maximal number of evaluations allowed. */<a name="line.48"></a>
<FONT color="green">049</FONT>        private int maxEvaluations;<a name="line.49"></a>
<FONT color="green">050</FONT>    <a name="line.50"></a>
<FONT color="green">051</FONT>        /** Number of iterations already performed for all starts. */<a name="line.51"></a>
<FONT color="green">052</FONT>        private int totalIterations;<a name="line.52"></a>
<FONT color="green">053</FONT>    <a name="line.53"></a>
<FONT color="green">054</FONT>        /** Number of evaluations already performed for all starts. */<a name="line.54"></a>
<FONT color="green">055</FONT>        private int totalEvaluations;<a name="line.55"></a>
<FONT color="green">056</FONT>    <a name="line.56"></a>
<FONT color="green">057</FONT>        /** Number of starts to go. */<a name="line.57"></a>
<FONT color="green">058</FONT>        private int starts;<a name="line.58"></a>
<FONT color="green">059</FONT>    <a name="line.59"></a>
<FONT color="green">060</FONT>        /** Random generator for multi-start. */<a name="line.60"></a>
<FONT color="green">061</FONT>        private RandomGenerator generator;<a name="line.61"></a>
<FONT color="green">062</FONT>    <a name="line.62"></a>
<FONT color="green">063</FONT>        /** Found optima. */<a name="line.63"></a>
<FONT color="green">064</FONT>        private double[] optima;<a name="line.64"></a>
<FONT color="green">065</FONT>    <a name="line.65"></a>
<FONT color="green">066</FONT>        /** Found function values at optima. */<a name="line.66"></a>
<FONT color="green">067</FONT>        private double[] optimaValues;<a name="line.67"></a>
<FONT color="green">068</FONT>    <a name="line.68"></a>
<FONT color="green">069</FONT>        /**<a name="line.69"></a>
<FONT color="green">070</FONT>         * Create a multi-start optimizer from a single-start optimizer<a name="line.70"></a>
<FONT color="green">071</FONT>         * @param optimizer single-start optimizer to wrap<a name="line.71"></a>
<FONT color="green">072</FONT>         * @param starts number of starts to perform (including the<a name="line.72"></a>
<FONT color="green">073</FONT>         * first one), multi-start is disabled if value is less than or<a name="line.73"></a>
<FONT color="green">074</FONT>         * equal to 1<a name="line.74"></a>
<FONT color="green">075</FONT>         * @param generator random generator to use for restarts<a name="line.75"></a>
<FONT color="green">076</FONT>         */<a name="line.76"></a>
<FONT color="green">077</FONT>        public MultiStartUnivariateRealOptimizer(final UnivariateRealOptimizer optimizer,<a name="line.77"></a>
<FONT color="green">078</FONT>                                                 final int starts,<a name="line.78"></a>
<FONT color="green">079</FONT>                                                 final RandomGenerator generator) {<a name="line.79"></a>
<FONT color="green">080</FONT>            this.optimizer        = optimizer;<a name="line.80"></a>
<FONT color="green">081</FONT>            this.totalIterations  = 0;<a name="line.81"></a>
<FONT color="green">082</FONT>            this.starts           = starts;<a name="line.82"></a>
<FONT color="green">083</FONT>            this.generator        = generator;<a name="line.83"></a>
<FONT color="green">084</FONT>            this.optima           = null;<a name="line.84"></a>
<FONT color="green">085</FONT>            setMaximalIterationCount(Integer.MAX_VALUE);<a name="line.85"></a>
<FONT color="green">086</FONT>            setMaxEvaluations(Integer.MAX_VALUE);<a name="line.86"></a>
<FONT color="green">087</FONT>        }<a name="line.87"></a>
<FONT color="green">088</FONT>    <a name="line.88"></a>
<FONT color="green">089</FONT>        /** {@inheritDoc} */<a name="line.89"></a>
<FONT color="green">090</FONT>        public double getFunctionValue() {<a name="line.90"></a>
<FONT color="green">091</FONT>            return optimizer.getFunctionValue();<a name="line.91"></a>
<FONT color="green">092</FONT>        }<a name="line.92"></a>
<FONT color="green">093</FONT>    <a name="line.93"></a>
<FONT color="green">094</FONT>        /** {@inheritDoc} */<a name="line.94"></a>
<FONT color="green">095</FONT>        public double getResult() {<a name="line.95"></a>
<FONT color="green">096</FONT>            return optimizer.getResult();<a name="line.96"></a>
<FONT color="green">097</FONT>        }<a name="line.97"></a>
<FONT color="green">098</FONT>    <a name="line.98"></a>
<FONT color="green">099</FONT>        /** {@inheritDoc} */<a name="line.99"></a>
<FONT color="green">100</FONT>        public double getAbsoluteAccuracy() {<a name="line.100"></a>
<FONT color="green">101</FONT>            return optimizer.getAbsoluteAccuracy();<a name="line.101"></a>
<FONT color="green">102</FONT>        }<a name="line.102"></a>
<FONT color="green">103</FONT>    <a name="line.103"></a>
<FONT color="green">104</FONT>        /** {@inheritDoc} */<a name="line.104"></a>
<FONT color="green">105</FONT>        public int getIterationCount() {<a name="line.105"></a>
<FONT color="green">106</FONT>            return totalIterations;<a name="line.106"></a>
<FONT color="green">107</FONT>        }<a name="line.107"></a>
<FONT color="green">108</FONT>    <a name="line.108"></a>
<FONT color="green">109</FONT>        /** {@inheritDoc} */<a name="line.109"></a>
<FONT color="green">110</FONT>        public int getMaximalIterationCount() {<a name="line.110"></a>
<FONT color="green">111</FONT>            return maxIterations;<a name="line.111"></a>
<FONT color="green">112</FONT>        }<a name="line.112"></a>
<FONT color="green">113</FONT>    <a name="line.113"></a>
<FONT color="green">114</FONT>        /** {@inheritDoc} */<a name="line.114"></a>
<FONT color="green">115</FONT>        public int getMaxEvaluations() {<a name="line.115"></a>
<FONT color="green">116</FONT>            return maxEvaluations;<a name="line.116"></a>
<FONT color="green">117</FONT>        }<a name="line.117"></a>
<FONT color="green">118</FONT>    <a name="line.118"></a>
<FONT color="green">119</FONT>        /** {@inheritDoc} */<a name="line.119"></a>
<FONT color="green">120</FONT>        public int getEvaluations() {<a name="line.120"></a>
<FONT color="green">121</FONT>            return totalEvaluations;<a name="line.121"></a>
<FONT color="green">122</FONT>        }<a name="line.122"></a>
<FONT color="green">123</FONT>    <a name="line.123"></a>
<FONT color="green">124</FONT>        /** {@inheritDoc} */<a name="line.124"></a>
<FONT color="green">125</FONT>        public double getRelativeAccuracy() {<a name="line.125"></a>
<FONT color="green">126</FONT>            return optimizer.getRelativeAccuracy();<a name="line.126"></a>
<FONT color="green">127</FONT>        }<a name="line.127"></a>
<FONT color="green">128</FONT>    <a name="line.128"></a>
<FONT color="green">129</FONT>        /** {@inheritDoc} */<a name="line.129"></a>
<FONT color="green">130</FONT>        public void resetAbsoluteAccuracy() {<a name="line.130"></a>
<FONT color="green">131</FONT>            optimizer.resetAbsoluteAccuracy();<a name="line.131"></a>
<FONT color="green">132</FONT>        }<a name="line.132"></a>
<FONT color="green">133</FONT>    <a name="line.133"></a>
<FONT color="green">134</FONT>        /** {@inheritDoc} */<a name="line.134"></a>
<FONT color="green">135</FONT>        public void resetMaximalIterationCount() {<a name="line.135"></a>
<FONT color="green">136</FONT>            optimizer.resetMaximalIterationCount();<a name="line.136"></a>
<FONT color="green">137</FONT>        }<a name="line.137"></a>
<FONT color="green">138</FONT>    <a name="line.138"></a>
<FONT color="green">139</FONT>        /** {@inheritDoc} */<a name="line.139"></a>
<FONT color="green">140</FONT>        public void resetRelativeAccuracy() {<a name="line.140"></a>
<FONT color="green">141</FONT>            optimizer.resetRelativeAccuracy();<a name="line.141"></a>
<FONT color="green">142</FONT>        }<a name="line.142"></a>
<FONT color="green">143</FONT>    <a name="line.143"></a>
<FONT color="green">144</FONT>        /** {@inheritDoc} */<a name="line.144"></a>
<FONT color="green">145</FONT>        public void setAbsoluteAccuracy(double accuracy) {<a name="line.145"></a>
<FONT color="green">146</FONT>            optimizer.setAbsoluteAccuracy(accuracy);<a name="line.146"></a>
<FONT color="green">147</FONT>        }<a name="line.147"></a>
<FONT color="green">148</FONT>    <a name="line.148"></a>
<FONT color="green">149</FONT>        /** {@inheritDoc} */<a name="line.149"></a>
<FONT color="green">150</FONT>        public void setMaximalIterationCount(int count) {<a name="line.150"></a>
<FONT color="green">151</FONT>            this.maxIterations = count;<a name="line.151"></a>
<FONT color="green">152</FONT>        }<a name="line.152"></a>
<FONT color="green">153</FONT>    <a name="line.153"></a>
<FONT color="green">154</FONT>        /** {@inheritDoc} */<a name="line.154"></a>
<FONT color="green">155</FONT>        public void setMaxEvaluations(int maxEvaluations) {<a name="line.155"></a>
<FONT color="green">156</FONT>            this.maxEvaluations = maxEvaluations;<a name="line.156"></a>
<FONT color="green">157</FONT>        }<a name="line.157"></a>
<FONT color="green">158</FONT>    <a name="line.158"></a>
<FONT color="green">159</FONT>        /** {@inheritDoc} */<a name="line.159"></a>
<FONT color="green">160</FONT>        public void setRelativeAccuracy(double accuracy) {<a name="line.160"></a>
<FONT color="green">161</FONT>            optimizer.setRelativeAccuracy(accuracy);<a name="line.161"></a>
<FONT color="green">162</FONT>        }<a name="line.162"></a>
<FONT color="green">163</FONT>    <a name="line.163"></a>
<FONT color="green">164</FONT>        /** Get all the optima found during the last call to {@link<a name="line.164"></a>
<FONT color="green">165</FONT>         * #optimize(UnivariateRealFunction, GoalType, double, double) optimize}.<a name="line.165"></a>
<FONT color="green">166</FONT>         * &lt;p&gt;The optimizer stores all the optima found during a set of<a name="line.166"></a>
<FONT color="green">167</FONT>         * restarts. The {@link #optimize(UnivariateRealFunction, GoalType,<a name="line.167"></a>
<FONT color="green">168</FONT>         * double, double) optimize} method returns the best point only. This<a name="line.168"></a>
<FONT color="green">169</FONT>         * method returns all the points found at the end of each starts,<a name="line.169"></a>
<FONT color="green">170</FONT>         * including the best one already returned by the {@link<a name="line.170"></a>
<FONT color="green">171</FONT>         * #optimize(UnivariateRealFunction, GoalType, double, double) optimize}<a name="line.171"></a>
<FONT color="green">172</FONT>         * method.<a name="line.172"></a>
<FONT color="green">173</FONT>         * &lt;/p&gt;<a name="line.173"></a>
<FONT color="green">174</FONT>         * &lt;p&gt;<a name="line.174"></a>
<FONT color="green">175</FONT>         * The returned array as one element for each start as specified<a name="line.175"></a>
<FONT color="green">176</FONT>         * in the constructor. It is ordered with the results from the<a name="line.176"></a>
<FONT color="green">177</FONT>         * runs that did converge first, sorted from best to worst<a name="line.177"></a>
<FONT color="green">178</FONT>         * objective value (i.e in ascending order if minimizing and in<a name="line.178"></a>
<FONT color="green">179</FONT>         * descending order if maximizing), followed by Double.NaN elements<a name="line.179"></a>
<FONT color="green">180</FONT>         * corresponding to the runs that did not converge. This means all<a name="line.180"></a>
<FONT color="green">181</FONT>         * elements will be NaN if the {@link #optimize(UnivariateRealFunction,<a name="line.181"></a>
<FONT color="green">182</FONT>         * GoalType, double, double) optimize} method did throw a {@link<a name="line.182"></a>
<FONT color="green">183</FONT>         * ConvergenceException ConvergenceException}). This also means that<a name="line.183"></a>
<FONT color="green">184</FONT>         * if the first element is not NaN, it is the best point found across<a name="line.184"></a>
<FONT color="green">185</FONT>         * all starts.&lt;/p&gt;<a name="line.185"></a>
<FONT color="green">186</FONT>         * @return array containing the optima<a name="line.186"></a>
<FONT color="green">187</FONT>         * @exception IllegalStateException if {@link #optimize(UnivariateRealFunction,<a name="line.187"></a>
<FONT color="green">188</FONT>         * GoalType, double, double) optimize} has not been called<a name="line.188"></a>
<FONT color="green">189</FONT>         * @see #getOptimaValues()<a name="line.189"></a>
<FONT color="green">190</FONT>         */<a name="line.190"></a>
<FONT color="green">191</FONT>        public double[] getOptima() throws IllegalStateException {<a name="line.191"></a>
<FONT color="green">192</FONT>            if (optima == null) {<a name="line.192"></a>
<FONT color="green">193</FONT>                throw MathRuntimeException.createIllegalStateException("no optimum computed yet");<a name="line.193"></a>
<FONT color="green">194</FONT>            }<a name="line.194"></a>
<FONT color="green">195</FONT>            return optima.clone();<a name="line.195"></a>
<FONT color="green">196</FONT>        }<a name="line.196"></a>
<FONT color="green">197</FONT>    <a name="line.197"></a>
<FONT color="green">198</FONT>        /** Get all the function values at optima found during the last call to {@link<a name="line.198"></a>
<FONT color="green">199</FONT>         * #optimize(UnivariateRealFunction, GoalType, double, double) optimize}.<a name="line.199"></a>
<FONT color="green">200</FONT>         * &lt;p&gt;<a name="line.200"></a>
<FONT color="green">201</FONT>         * The returned array as one element for each start as specified<a name="line.201"></a>
<FONT color="green">202</FONT>         * in the constructor. It is ordered with the results from the<a name="line.202"></a>
<FONT color="green">203</FONT>         * runs that did converge first, sorted from best to worst<a name="line.203"></a>
<FONT color="green">204</FONT>         * objective value (i.e in ascending order if minimizing and in<a name="line.204"></a>
<FONT color="green">205</FONT>         * descending order if maximizing), followed by Double.NaN elements<a name="line.205"></a>
<FONT color="green">206</FONT>         * corresponding to the runs that did not converge. This means all<a name="line.206"></a>
<FONT color="green">207</FONT>         * elements will be NaN if the {@link #optimize(UnivariateRealFunction,<a name="line.207"></a>
<FONT color="green">208</FONT>         * GoalType, double, double) optimize} method did throw a {@link<a name="line.208"></a>
<FONT color="green">209</FONT>         * ConvergenceException ConvergenceException}). This also means that<a name="line.209"></a>
<FONT color="green">210</FONT>         * if the first element is not NaN, it is the best point found across<a name="line.210"></a>
<FONT color="green">211</FONT>         * all starts.&lt;/p&gt;<a name="line.211"></a>
<FONT color="green">212</FONT>         * @return array containing the optima<a name="line.212"></a>
<FONT color="green">213</FONT>         * @exception IllegalStateException if {@link #optimize(UnivariateRealFunction,<a name="line.213"></a>
<FONT color="green">214</FONT>         * GoalType, double, double) optimize} has not been called<a name="line.214"></a>
<FONT color="green">215</FONT>         * @see #getOptima()<a name="line.215"></a>
<FONT color="green">216</FONT>         */<a name="line.216"></a>
<FONT color="green">217</FONT>        public double[] getOptimaValues() throws IllegalStateException {<a name="line.217"></a>
<FONT color="green">218</FONT>            if (optimaValues == null) {<a name="line.218"></a>
<FONT color="green">219</FONT>                throw MathRuntimeException.createIllegalStateException("no optimum computed yet");<a name="line.219"></a>
<FONT color="green">220</FONT>            }<a name="line.220"></a>
<FONT color="green">221</FONT>            return optimaValues.clone();<a name="line.221"></a>
<FONT color="green">222</FONT>        }<a name="line.222"></a>
<FONT color="green">223</FONT>    <a name="line.223"></a>
<FONT color="green">224</FONT>        /** {@inheritDoc} */<a name="line.224"></a>
<FONT color="green">225</FONT>        public double optimize(final UnivariateRealFunction f, final GoalType goalType,<a name="line.225"></a>
<FONT color="green">226</FONT>                               final double min, final double max)<a name="line.226"></a>
<FONT color="green">227</FONT>            throws ConvergenceException,<a name="line.227"></a>
<FONT color="green">228</FONT>                FunctionEvaluationException {<a name="line.228"></a>
<FONT color="green">229</FONT>    <a name="line.229"></a>
<FONT color="green">230</FONT>            optima           = new double[starts];<a name="line.230"></a>
<FONT color="green">231</FONT>            optimaValues     = new double[starts];<a name="line.231"></a>
<FONT color="green">232</FONT>            totalIterations  = 0;<a name="line.232"></a>
<FONT color="green">233</FONT>            totalEvaluations = 0;<a name="line.233"></a>
<FONT color="green">234</FONT>    <a name="line.234"></a>
<FONT color="green">235</FONT>            // multi-start loop<a name="line.235"></a>
<FONT color="green">236</FONT>            for (int i = 0; i &lt; starts; ++i) {<a name="line.236"></a>
<FONT color="green">237</FONT>    <a name="line.237"></a>
<FONT color="green">238</FONT>                try {<a name="line.238"></a>
<FONT color="green">239</FONT>                    optimizer.setMaximalIterationCount(maxIterations - totalIterations);<a name="line.239"></a>
<FONT color="green">240</FONT>                    optimizer.setMaxEvaluations(maxEvaluations - totalEvaluations);<a name="line.240"></a>
<FONT color="green">241</FONT>                    final double bound1 = (i == 0) ? min : min + generator.nextDouble() * (max - min);<a name="line.241"></a>
<FONT color="green">242</FONT>                    final double bound2 = (i == 0) ? max : min + generator.nextDouble() * (max - min);<a name="line.242"></a>
<FONT color="green">243</FONT>                    optima[i]       = optimizer.optimize(f, goalType,<a name="line.243"></a>
<FONT color="green">244</FONT>                                                         Math.min(bound1, bound2),<a name="line.244"></a>
<FONT color="green">245</FONT>                                                         Math.max(bound1, bound2));<a name="line.245"></a>
<FONT color="green">246</FONT>                    optimaValues[i] = optimizer.getFunctionValue();<a name="line.246"></a>
<FONT color="green">247</FONT>                } catch (FunctionEvaluationException fee) {<a name="line.247"></a>
<FONT color="green">248</FONT>                    optima[i]       = Double.NaN;<a name="line.248"></a>
<FONT color="green">249</FONT>                    optimaValues[i] = Double.NaN;<a name="line.249"></a>
<FONT color="green">250</FONT>                } catch (ConvergenceException ce) {<a name="line.250"></a>
<FONT color="green">251</FONT>                    optima[i]       = Double.NaN;<a name="line.251"></a>
<FONT color="green">252</FONT>                    optimaValues[i] = Double.NaN;<a name="line.252"></a>
<FONT color="green">253</FONT>                }<a name="line.253"></a>
<FONT color="green">254</FONT>    <a name="line.254"></a>
<FONT color="green">255</FONT>                totalIterations  += optimizer.getIterationCount();<a name="line.255"></a>
<FONT color="green">256</FONT>                totalEvaluations += optimizer.getEvaluations();<a name="line.256"></a>
<FONT color="green">257</FONT>    <a name="line.257"></a>
<FONT color="green">258</FONT>            }<a name="line.258"></a>
<FONT color="green">259</FONT>    <a name="line.259"></a>
<FONT color="green">260</FONT>            // sort the optima from best to worst, followed by NaN elements<a name="line.260"></a>
<FONT color="green">261</FONT>            int lastNaN = optima.length;<a name="line.261"></a>
<FONT color="green">262</FONT>            for (int i = 0; i &lt; lastNaN; ++i) {<a name="line.262"></a>
<FONT color="green">263</FONT>                if (Double.isNaN(optima[i])) {<a name="line.263"></a>
<FONT color="green">264</FONT>                    optima[i] = optima[--lastNaN];<a name="line.264"></a>
<FONT color="green">265</FONT>                    optima[lastNaN + 1] = Double.NaN;<a name="line.265"></a>
<FONT color="green">266</FONT>                    optimaValues[i] = optimaValues[--lastNaN];<a name="line.266"></a>
<FONT color="green">267</FONT>                    optimaValues[lastNaN + 1] = Double.NaN;<a name="line.267"></a>
<FONT color="green">268</FONT>                }<a name="line.268"></a>
<FONT color="green">269</FONT>            }<a name="line.269"></a>
<FONT color="green">270</FONT>    <a name="line.270"></a>
<FONT color="green">271</FONT>            double currX = optima[0];<a name="line.271"></a>
<FONT color="green">272</FONT>            double currY = optimaValues[0];<a name="line.272"></a>
<FONT color="green">273</FONT>            for (int j = 1; j &lt; lastNaN; ++j) {<a name="line.273"></a>
<FONT color="green">274</FONT>                final double prevY = currY;<a name="line.274"></a>
<FONT color="green">275</FONT>                currX = optima[j];<a name="line.275"></a>
<FONT color="green">276</FONT>                currY = optimaValues[j];<a name="line.276"></a>
<FONT color="green">277</FONT>                if ((goalType == GoalType.MAXIMIZE) ^ (currY &lt; prevY)) {<a name="line.277"></a>
<FONT color="green">278</FONT>                    // the current element should be inserted closer to the beginning<a name="line.278"></a>
<FONT color="green">279</FONT>                    int i = j - 1;<a name="line.279"></a>
<FONT color="green">280</FONT>                    double mIX = optima[i];<a name="line.280"></a>
<FONT color="green">281</FONT>                    double mIY = optimaValues[i];<a name="line.281"></a>
<FONT color="green">282</FONT>                    while ((i &gt;= 0) &amp;&amp; ((goalType == GoalType.MAXIMIZE) ^ (currY &lt; mIY))) {<a name="line.282"></a>
<FONT color="green">283</FONT>                        optima[i + 1]       = mIX;<a name="line.283"></a>
<FONT color="green">284</FONT>                        optimaValues[i + 1] = mIY;<a name="line.284"></a>
<FONT color="green">285</FONT>                        if (i-- != 0) {<a name="line.285"></a>
<FONT color="green">286</FONT>                            mIX = optima[i];<a name="line.286"></a>
<FONT color="green">287</FONT>                            mIY = optimaValues[i];<a name="line.287"></a>
<FONT color="green">288</FONT>                        } else {<a name="line.288"></a>
<FONT color="green">289</FONT>                            mIX = Double.NaN;<a name="line.289"></a>
<FONT color="green">290</FONT>                            mIY = Double.NaN;<a name="line.290"></a>
<FONT color="green">291</FONT>                        }<a name="line.291"></a>
<FONT color="green">292</FONT>                    }<a name="line.292"></a>
<FONT color="green">293</FONT>                    optima[i + 1]       = currX;<a name="line.293"></a>
<FONT color="green">294</FONT>                    optimaValues[i + 1] = currY;<a name="line.294"></a>
<FONT color="green">295</FONT>                    currX = optima[j];<a name="line.295"></a>
<FONT color="green">296</FONT>                    currY = optimaValues[j];<a name="line.296"></a>
<FONT color="green">297</FONT>                }<a name="line.297"></a>
<FONT color="green">298</FONT>            }<a name="line.298"></a>
<FONT color="green">299</FONT>    <a name="line.299"></a>
<FONT color="green">300</FONT>            if (Double.isNaN(optima[0])) {<a name="line.300"></a>
<FONT color="green">301</FONT>                throw new OptimizationException(<a name="line.301"></a>
<FONT color="green">302</FONT>                        "none of the {0} start points lead to convergence",<a name="line.302"></a>
<FONT color="green">303</FONT>                        starts);<a name="line.303"></a>
<FONT color="green">304</FONT>            }<a name="line.304"></a>
<FONT color="green">305</FONT>    <a name="line.305"></a>
<FONT color="green">306</FONT>            // return the found point given the best objective function value<a name="line.306"></a>
<FONT color="green">307</FONT>            return optima[0];<a name="line.307"></a>
<FONT color="green">308</FONT>    <a name="line.308"></a>
<FONT color="green">309</FONT>        }<a name="line.309"></a>
<FONT color="green">310</FONT>    <a name="line.310"></a>
<FONT color="green">311</FONT>        /** {@inheritDoc} */<a name="line.311"></a>
<FONT color="green">312</FONT>        public double optimize(final UnivariateRealFunction f, final GoalType goalType,<a name="line.312"></a>
<FONT color="green">313</FONT>                               final double min, final double max, final double startValue)<a name="line.313"></a>
<FONT color="green">314</FONT>                throws ConvergenceException, FunctionEvaluationException {<a name="line.314"></a>
<FONT color="green">315</FONT>            return optimize(f, goalType, min, max);<a name="line.315"></a>
<FONT color="green">316</FONT>        }<a name="line.316"></a>
<FONT color="green">317</FONT>    <a name="line.317"></a>
<FONT color="green">318</FONT>    }<a name="line.318"></a>




























































</PRE>
</BODY>
</HTML>
